An Improved Move-To-Front(IMTF) Off-line Algorithm for the List Accessing Problem
نویسندگان
چکیده
AbstractFor the List Accessing Problem, Move-To-Front (MTF) algorithm has been proved to be the best performing online list accessing algorithm till date in the literature[10]. In this paper, we have made a comprehensive analysis of MTF algorithm and developed an Improved-MTF (IMTF) offline algorithm. We have generated two new types of data set and devise a new method of experimental analysis for our proposed algorithm. Our experimental analysis shows that IMTF is performing better than MTF algorithm.
منابع مشابه
Characterization of Request Sequences for List Accessing Problem and New Theoretical Results for MTF Algorithm
List Accessing Problem is a well studied research problem in the context of linear search. Input to the list accessing problem is an unsorted linear list of distinct elements along with a sequence of requests, where each request is an access operation on an element of the list. A list accessing algorithm reorganizes the list while processing a request sequence on the list in order to minimize t...
متن کاملIcraet P5
List accessing problem has been studied as a problem of significant theoretical and practical interest in the context of linear search. Various list accessing algorithms have been proposed in the literature and their performances have been analyzed theoretically and experimentally. Move-To-Front (MTF), Transpose (TRANS) and Frequency Count (FC) are the three primitive and widely used list acces...
متن کاملA New Family of Randomized Algorithms for List Accessing
Sequential lists are a frequently used data structure for implementing dictionaries. Recently, self-organizing sequential lists have been proposed for \engines" in eecient data compression algorithms. In this paper, we investigate the problem of list accessing from the perspective of competitive analysis. We establish a connection between random-ized list accessing algorithms and Markov chains,...
متن کاملAmortized Efficiency of List
In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that move-to-front is within a consfant factor of optimum among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and fre...
متن کاملA Distributed List Update Problem
The list update problem is studied in a distributed environment where the set of items is partitioned across two processors and in which the cost of accessing an item is a combination of a list searching cost and a communication cost. A natural generalization of the Move-To-Front (MTF) algorithm, called Distributed Move-To-Front (DMTF), is analyzed under two models of information available to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1105.0187 شماره
صفحات -
تاریخ انتشار 2011